A multi-class structured dictionary learning method using discriminant atom selection
نویسندگان
چکیده
منابع مشابه
A Structured Dictionary Learning Method for Multi-scale Sparse Representation
In this paper, we address the problem of learning multi-scale sparse representations of natural images using structured dictionaries. Dictionaries learned by traditional algorithms have two major limitations: lack of structure and fixed size. These methods treat atoms independently from each other, and do not exploit possible relationships between them. Fixed size of atoms restricts the flexibi...
متن کاملA Multi Linear Discriminant Analysis Method Using a Subtraction Criteria
Linear dimension reduction has been used in different application such as image processing and pattern recognition. All these data folds the original data to vectors and project them to an small dimensions. But in some applications such we may face with data that are not vectors such as image data. Folding the multidimensional data to vectors causes curse of dimensionality and mixed the differe...
متن کاملStructured Dictionary Learning for Classification
Sparsity driven signal processing has gained tremendous popularity in the last decade. At its core, the assumption is that the signal of interest is sparse with respect to either a fixed transformation or a signal dependent dictionary. To better capture the data characteristics, various dictionary learning methods have been proposed for both reconstruction and classification tasks. For classifi...
متن کاملMulti-Scale Saliency Detection using Dictionary Learning
Saliency detection has drawn a lot of attention of researchers in various fields over the past several years. Saliency is the perceptual quality that makes an object, person to draw the attention of humans at the very sight. Salient object detection in an image has been used centrally in many computational photography and computer vision applications like video compression [1], object recogniti...
متن کاملMulti-class Discriminant Kernel Learning via Convex Programming
Regularized kernel discriminant analysis (RKDA) performs linear discriminant analysis in the feature space via the kernel trick. Its performance depends on the selection of kernels. In this paper, we consider the problem of multiple kernel learning (MKL) for RKDA, in which the optimal kernel matrix is obtained as a linear combination of pre-specified kernel matrices. We show that the kernel lea...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Pattern Analysis and Applications
سال: 2020
ISSN: 1433-7541,1433-755X
DOI: 10.1007/s10044-020-00939-9